A Short Note on the Interior of the Completely Positive Cone
نویسنده
چکیده
A symmetric matrix is defined to be completely positive if it allows a factorisation BB , where B is an entrywise nonnegative matrix. This set is useful in certain optimisation problems. The interior of the completely positive cone has previously been characterised by Dür and Still [7]. In this paper we introduce the concept of the set of zeros in the nonnegative orthant for a quadratic form and use the properties of this set to give a more relaxed characterisation of the interior of the completely positive cone.
منابع مشابه
Global convergence of an inexact interior-point method for convex quadratic symmetric cone programming
In this paper, we propose a feasible interior-point method for convex quadratic programming over symmetric cones. The proposed algorithm relaxes the accuracy requirements in the solution of the Newton equation system, by using an inexact Newton direction. Furthermore, we obtain an acceptable level of error in the inexact algorithm on convex quadratic symmetric cone programmin...
متن کاملEla an Improved Characterisation of the Interior of the Completely Positive Cone
A symmetric matrix is defined to be completely positive if it allows a factorisation BB , where B is an entrywise nonnegative matrix. This set is useful in certain optimisation problems. The interior of the completely positive cone has previously been characterised by Dür and Still [M. Dür and G. Still, Interior points of the completely positive cone, Electronic Journal of Linear Algebra, 17:48...
متن کاملAn improved characterisation of the interior of the completely positive cone
A symmetric matrix is defined to be completely positive if it allows a factorisation BB , where B is an entrywise nonnegative matrix. This set is useful in certain optimisation problems. The interior of the completely positive cone has previously been characterised by Dür and Still [M. Dür and G. Still, Interior points of the completely positive cone, Electronic Journal of Linear Algebra, 17:48...
متن کاملA full Nesterov-Todd step interior-point method for circular cone optimization
In this paper, we present a full Newton step feasible interior-pointmethod for circular cone optimization by using Euclidean Jordanalgebra. The search direction is based on the Nesterov-Todd scalingscheme, and only full-Newton step is used at each iteration.Furthermore, we derive the iteration bound that coincides with thecurrently best known iteration bound for small-update methods.
متن کاملA full Nesterov-Todd step infeasible interior-point algorithm for symmetric cone linear complementarity problem
A full Nesterov-Todd (NT) step infeasible interior-point algorithm is proposed for solving monotone linear complementarity problems over symmetric cones by using Euclidean Jordan algebra. Two types of full NT-steps are used, feasibility steps and centering steps. The algorithm starts from strictly feasible iterates of a perturbed problem, and, using the central path and feasi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010